Spanning universality in random graphs
نویسندگان
چکیده
منابع مشابه
Almost-spanning universality in random graphs
A graph G is said to be H(n,∆)-universal if it contains every graph on at most n vertices with maximum degree at most ∆. It is known that for any ε > 0 and any natural number ∆ there exists c > 0 such that the random graph G(n, p) is asymptotically almost surely H((1− ε)n,∆)universal for p ≥ c(log n/n). Bypassing this natural boundary, we show that for ∆ ≥ 3 the same conclusion holds when p n− ...
متن کاملEmbedding Spanning Trees in Random Graphs
We prove that if T is a tree on n vertices with maximum degree ∆ and the edge probability p(n) satisfies: np ≥ C max{∆ log n, n } for some constant > 0, then with high probability the random graph G(n, p) contains a copy of T . The obtained bound on the edge probability is shown to be essentially tight for ∆ = n.
متن کاملUniversality of random graphs and rainbow embedding
In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of G(n, p). First, we show that if p = ω(∆8n−1/2 log n), then w.h.p a graph G ∼ G(n, p) contains copies of all the spanning trees with maximum degree bounded by ∆. This improves a result of Johannsen, Krivelevich and Samotij. Next, using similar methods we show that for p = ω(∆12n−1...
متن کاملRamsey and Universality Properties of Random Graphs
This thesis investigates the interplay between two branches of discrete mathematics: Ramsey theory and random graphs. The origins of Ramsey theory can already be found in the work of Hilbert from the early 20th century. However, it was a simple but profound result of Frank P. Ramsey from 1930 which marked the beginning of the new field in mathematics. Phrased in graph theory terms, Ramsey’s the...
متن کاملSpanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2018
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20816